Strong duality with super efficiency in set-valued optimization
نویسندگان
چکیده
منابع مشابه
Approximate Fenchel-Lagrangian Duality for Constrained Set-Valued Optimization Problems
In this article, we construct a Fenchel-Lagrangian ε-dual problem for set-valued optimization problems by using the perturbation methods. Some relationships between the solutions of the primal and the dual problems are discussed. Moreover, an ε-saddle point theorem is proved.
متن کاملWEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS
The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...
متن کاملSuper Efficiency in Vector Optimization
We introduce a new concept of efficiency in vector optimization. This concept, super efficiency, is shown to have many desirable properties. In particular, we show that in reasonable settings the super efficient points of a set are norm-dense in the efficient frontier. We also provide a Chebyshev characterization of super efficient points for nonconvex sets and a scalarization theory when the u...
متن کاملOptimization with set relations: Conjugate Duality
The aim of this paper is to develop a conjugate duality theory for convex set–valued maps. The basic idea is to understand a convex set–valued map as a function with values in the space of closed convex subsets of R. The usual inclusion of sets provides a natural ordering relation in this space. Infimum and supremum with respect to this ordering relation can be expressed with aid of union and i...
متن کاملOptimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone
In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Nonlinear Sciences and Applications
سال: 2017
ISSN: 2008-1898,2008-1901
DOI: 10.22436/jnsa.010.06.37